Nondeterministic finite automaton

Results: 144



#Item
215 Representing distributions over strings with automata and grammars T

5 Representing distributions over strings with automata and grammars T

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2010-07-20 08:11:02
221  Static Specification Mining Using Automata-Based Abstractions Sharon Shoham

1 Static Specification Mining Using Automata-Based Abstractions Sharon Shoham

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2008-06-04 09:57:06
23The Monad.Reader Issue 16 by Aran Donohue  and John W. Lato  and Louis Wasserman  May 12, 2010

The Monad.Reader Issue 16 by Aran Donohue and John W. Lato and Louis Wasserman May 12, 2010

Add to Reading List

Source URL: themonadreader.files.wordpress.com

Language: English - Date: 2010-05-12 14:00:40
24Synthesis for Regular Specifications over Unbounded Domains Jad Hamza∗, Barbara Jobstmann†, Viktor Kuncak‡ ∗ ENS  Cachan, France † CNRS/Verimag, France, ‡ EPFL, Switzerland

Synthesis for Regular Specifications over Unbounded Domains Jad Hamza∗, Barbara Jobstmann†, Viktor Kuncak‡ ∗ ENS Cachan, France † CNRS/Verimag, France, ‡ EPFL, Switzerland

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2010-08-02 10:05:45
25Models of Computation  Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please

Models of Computation Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:08
26Models of Computation  Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send

Models of Computation Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:05
27Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Add to Reading List

Source URL: pauillac.inria.fr

Language: English - Date: 2008-12-14 19:37:35
28On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

Add to Reading List

Source URL: markburgess.org

Language: English - Date: 2014-12-18 08:35:34
29Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik  7, RWTH Aachen, Germany

Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik 7, RWTH Aachen, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 11:02:30
30FREE WILL—EVEN FOR ROBOTS John McCarthy Computer Science Department Stanford University Stanford, CA 94305, USA

FREE WILL—EVEN FOR ROBOTS John McCarthy Computer Science Department Stanford University Stanford, CA 94305, USA

Add to Reading List

Source URL: www-formal.stanford.edu

Language: English - Date: 2002-03-26 18:13:58